Near Admissible Algorithms for Multiobjective Search
نویسندگان
چکیده
In this paper, we propose near admissible multiobjective search algorithms to approximate, with performance guarantee, the set of Pareto optimal solution paths in a state space graph. Approximation of Pareto optimality relies on the use of an epsilon-dominance relation between vectors, significantly narrowing the set of nondominated solutions. We establish correctness of the proposed algorithms, and discuss computational complexity issues. We present numerical experimentations, showing that approximation significantly improves resolution times in multiobjective search problems.
منابع مشابه
Incremental Weight Elicitation for Multiobjective State Space Search
This paper proposes incremental preference elicitation methods for multiobjective state space search. Our approach consists in integrating weight elicitation and search to determine, in a vector-valued state-space graph, a solution path that best fits the Decision Maker’s preferences. We first assume that the objective weights are imprecisely known and propose a state space search procedure to ...
متن کاملMultiobjective , preference - based search in acyclic OR - graphs *
We consider the problem of determining a most preferred path from a start node to a goal node set in an acyclic OR-graph, given a multiattribute preference function, a multiobjective reward structure, and heuristic information about this reward structure. We present an algorithm which is shown to terminate with a most preferred path, given an admissible heuristic set. The algorithm illustrates ...
متن کاملIterative Deepening Multiobjective A
Many real-world optimization problems involve multiple objectives which are often conflicting. When conventional heuristic search algorithms such as A* and IDA* are used for solving such problems, then these problems have to be modeled as simple cost minimization or maximization problems. The task of modeling such problems using a single valued criterion has often proved difficult [6]. The prob...
متن کاملAn Evolutionary Search Algorithm to Guide Stochastic Search for Near-Native Protein Conformations with Multiobjective Analysis
Predicting native conformations of a protein sequence is known as de novo structure prediction and is a central challenge in computational biology. Most computational protocols employ Monte Carlo sampling. Evolutionary search algorithms have also been proposed to enhance sampling of near-native conformations. These approaches bias stochastic search by an energy function, even though current ene...
متن کاملEvolutionary Multiobjective Optimization for Fuzzy Knowledge Extraction
− A new trend in the design of fuzzy rulebased systems is the use of evolutionary multiobjective optimization (EMO) algorithms. This trend is observed in various areas in machine learning. EMO algorithms are often used to search for a number of Pareto-optimal non-linear systems with respect to their accuracy and complexity. In this paper, we first explain some basic concepts in multiobjective o...
متن کامل